Circuit Complexity in Z2 EEFT

نویسندگان

چکیده

Motivated by recent studies of circuit complexity in weakly interacting scalar field theory, we explore the computation Z2 Even Effective Field Theories (Z2 EEFTs). We consider a massive free theory with higher-order Wilsonian operators such as ϕ4, ϕ6, and ϕ8. To facilitate our computation, regularize putting it on lattice. First, simple case two oscillators later generalize results to N oscillators. This study was carried out for nearly Gaussian states. In reference state is an approximately unentangled state, corresponding target calculated from entangled state. compute using geometric approach developed Nielsen, parameterizing path-ordered unitary transformation minimizing geodesic space unitaries. The contribution discussed. also dependency other parameters various cases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Circuit Complexity

Combinational circuits or shortly circuits are a model of the lowest level of computer hardware which is of interest from the point of view of computer science. Circuit complexity has a longer history than complexity theory. Complexity measures like circuit size and depth model sequential time, hardware cost, parallel time, and even storage space. This chapter contains an overview on the resear...

متن کامل

Some Results in Circuit Complexity

The thesis consists of three parts. The first part investigates the AC complexity of subgraph isomorphism problem that is, detecting whether an n-vertex input graph contains a P -subgraph for some fixed P . For the average-case complexity, where the input is a distribution on random graphs at the threshold and small error is allowed, we are able to explicitly characterize the minimal AC size up...

متن کامل

Using Duality in Circuit Complexity

We investigate in a method for proving separation results for abstract classes of languages. A well established method to characterize varieties of regular languages are identities. We use a recently established generalization of these identities to non-regular languages by Gehrke, Grigorieff, and Pin: so called equations, which are capable of describing arbitrary Boolean algebras of languages....

متن کامل

VC Dimension in Circuit Complexity

The main result of this paper is a (n 1=4) lower bound on the size of a sigmoidal circuit computing a speciic AC 0 2 function. This is the rst lower bound for the computation model of sigmoidal circuits with unbounded weights. We also give upper and lower bounds for the same function in a few other computation models: circuits of AND/OR gates, threshold circuits, and circuits of piecewise-ratio...

متن کامل

Quantum Circuit Complexity

We propose a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a quantum Turing machine has a polynomial-size quantum circuit. This result also enables us to construct a universal quantum computer which can simulate, with a polynomial factor slowdown, a broader class of quantum machines ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2022

ISSN: ['0865-4824', '2226-1877']

DOI: https://doi.org/10.3390/sym15010031